On bounded languages and reversal-bounded automata
نویسندگان
چکیده
منابع مشابه
On Reversal-Bounded Picture Languages
Kim, C. and I.H. Sudborough, On reversal-bounded picture languages, Theoretical Computer Science 104 (1992) 185-206. For an integer k >O, a k-reversal-bounded picture language is a chain-code picture language which is described by a language L over the alphabet R= {u,d,r, I} such that, for every word x in L, the number of alternating occurrences of r’s and I’s in x is bounded by k. It is shown ...
متن کاملPushdown Automata with Reversal-Bounded Counters
The main result of this paper is that a pushdown automaton M augmented with R(n) reversal-bounded counters can be simulated by a Turing machine in time polynomial in n”’ + R(n) if M is 2-way, and in time polynomial in n + R(n) if M is l-way. It follows from this and previous results that for sufficiently large R(n), the addition of a pushdown store to R(n) reversal-bounded multicounter machines...
متن کاملBounded Languages Meet Cellular Automata with Sparse Communication
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell communication by bounding the number of allowed uses of the links between cells. Moreover, we consider the devices as acceptors for bounded languages in order to ex...
متن کاملBounded Parikh Automata
Motivation. Adding features to finite automata in order to capture situations beyond regularity has been fruitful to many areas of research. Such features include making the state sets infinite, adding power to the logical characterizations, having the automata operate on infinite domains rather than finite alphabets, adding stack-like mechanisms, etc. (See, e.g., [11, 3, 17, 1].) Model checkin...
متن کاملBounded-oscillation Pushdown Automata
We present an underapproximation for context-free languages by filtering out runs of the underlying pushdown automaton depending on how the stack height evolves over time. In particular, we assign to each run a number quantifying the oscillating behavior of the stack along the run. We study languages accepted by pushdown automata restricted to k-oscillating runs. We relate oscillation on pushdo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2016
ISSN: 0890-5401
DOI: 10.1016/j.ic.2015.11.007